正反向量子斯特林循环有限时间热力学性能界限和优化准则

研究了正反向量子斯特林循环的最优性能.在经典极限下,导出了循环的有限时间热力学性能界限和优化准则.得到了斯特林热机、制冷机和热泵特性参数之间的优化关系.     

基于副载波参考波形方法的GNSS双载波环多径抑制技术

为了实现对高阶BOC信号的无模糊和抗多径接收,本文将码相关参考波形的闸波设计思路应用于GNSS双载波环路接收方法的副载波锁相环,通过在副载波锁相环中引入设计的闸波参与信号的相干积分过程,使双载波环法具备抗多径性能,同时该方法并不需要额外引入相关器。本文对该设计方法的理论和具体实现进行了阐述和分析,从副载波多径误差包络和跟踪精度两方面对改进的双载波环路方法性能进行了评估。仿真结果显示,采用的算法与双载波环路法相比可以降低BOC(1, 1)信号81.1%的副载波多径误差包络面积,以及BOC(14, 2)信号75.1%的副载波多径误差包络面积。但是,改进的双载波环路法将带来-6dB的相干积分后载噪比损失,降低跟踪精度。因此,在闸波设计参数设计上,需要谨慎选择以平衡算法的多径抑制和跟踪精度性能。综合来看,该方法适用于解决非弱信号条件下及多径环境下的高阶BOC信号接收问题。     

面向体系的目标选择形式化描述及分析

针对信息化条件下各类目标相互作用反制作战能力倍增的特点,进行面向体系目标选择的相关问题分析。通过分析目标体系的概念和层次结构,建立目标选择的概念模型,并进行目标选择的形式化描述与分析,提供了一种研究军事概念模型的思路和方法,有助于目标选择决策支持系统的开发与验证。     

耗尽关机制导方法研究

本文研究了固体弹道导弹耗尽关机制导方法,提出了一种适用于无推力终止系统工作的固体弹道导弹．在要求能量随机耗尽条件下的混合制导模型,并进行仿真分析,论证了方案的可行性。     

连续求解样本协方差矩阵迹的快速递推算法

为解决当样本数据不断增加时,利用传统方法反复计算样本协方差迹耗时多的缺点,提出了一种快速递推算法。理论分析和仿真试验都表明,算法的时间复杂度比传统的方法降低了一个数量级,从而大大减少了计算时间。     

A balancing problem for mixed model assembly lines with a paced moving conveyor

We state a balancing problem for mixed model assembly lines with a paced moving conveyor as: Given the daily assembling sequence of the models, the tasks of each model, the precedence relations among the tasks, and the operations parameters of the assembly line, assign the tasks of the models to the workstations so as to minimize the total overload time. Several characteristics of the problem are investigated. A line‐balancing heuristic is proposed based on a lower bound of the total overload time. A practical procedure is provided for estimating the deviation of any given line‐balance solution from the theoretical optimum. Numerical examples are given to illustrate the methodology. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004.     

Flow shop scheduling with earliness,tardiness, and intermediate inventory holding costs

We consider the problem of scheduling customer orders in a flow shop with the objective of minimizing the sum of tardiness, earliness (finished goods inventory holding), and intermediate (work‐in‐process) inventory holding costs. We formulate this problem as an integer program, and based on approximate solutions to two different, but closely related, Dantzig‐Wolfe reformulations, we develop heuristics to minimize the total cost. We exploit the duality between Dantzig‐Wolfe reformulation and Lagrangian relaxation to enhance our heuristics. This combined approach enables us to develop two different lower bounds on the optimal integer solution, together with intuitive approaches for obtaining near‐optimal feasible integer solutions. To the best of our knowledge, this is the first paper that applies column generation to a scheduling problem with different types of strongly ????‐hard pricing problems which are solved heuristically. The computational study demonstrates that our algorithms have a significant speed advantage over alternate methods, yield good lower bounds, and generate near‐optimal feasible integer solutions for problem instances with many machines and a realistically large number of jobs. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004.     

On the uncapacitated K‐commodity network design problem with zero flow‐costs

Extending Sastry's result on the uncapacitated two‐commodity network design problem, we completely characterize the optimal solution of the uncapacitated K‐commodity network design problem with zero flow costs for the case when K = 3. By solving a set of shortest‐path problems on related graphs, we show that the optimal solutions can be found in O(n³) time when K = 3, where n is the number of nodes in the network. The algorithm depends on identifying a list of “basic patterns”; the number of basic patterns grows exponentially with K. We also show that the uncapacitated K‐commodity network design problem can be solved in O(n³) time for general K if K is fixed; otherwise, the time for solving the problem is exponential. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004     

Higher‐order Markov chain models for categorical data sequences*

In this paper we study higher‐order Markov chain models for analyzing categorical data sequences. We propose an efficient estimation method for the model parameters. Data sequences such as DNA and sales demand are used to illustrate the predicting power of our proposed models. In particular, we apply the developed higher‐order Markov chain model to the server logs data. The objective here is to model the users' behavior in accessing information and to predict their behavior in the future. Our tests are based on a realistic web log and our model shows an improvement in prediction. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004     

BIT系统的三态马尔可夫模型分析

BIT技术是改善系统测试性和诊断能力的重要途径,但是较高的虚警率一直是阻碍BIT广泛应用的一个重要原因。研究过程中将系统状态划分为正常、间歇、故障三种状态,建立了马尔可夫模型,分析、对比了三态模型与两态模型的关系。理论分析结果表明:基于三态模型的BIT,在提高故障检测率的同时,还可以较大程度地降低虚警率。